Detecting Communities from Social Tagging Networks Based on Tripartite Modularity

نویسنده

  • Tsuyoshi Murata
چکیده

Online social media such as delicious and digg are represented as tripartite networks whose vertices are users, tags, and resources. Detecting communities from such tripartite networks is practically important. Newman-Girvan modularity is often used as the criteria for evaluating the goodness of network divisions into communities. Murata has extended Newman-Girvan modularity in order to evaluate the quality of the division of tripartite networks. This paper shows the results of community detection from large-scale real social tagging networks based on Murata’s tripartite modularity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

متن کامل

Community Detection Based on Topic Distance in Social Tagging Networks

Research on the community detection in social tagging networks has attracted much attention in the last decade. Extracting the hidden topic information from tags provides a new way of thinking for community detection in social tagging networks. In this paper, a topic tagging network by extracting several topics from the tags through using the Latent Dirichlet Allocation (LDA) model is built fir...

متن کامل

Learning Mixed Membership Community Models in Social Tagging Networks through Tensor Methods

Community detection in graphs has been extensively studied both in theory and in applications. However, detecting communities in hypergraphs is more challenging. In this paper, we propose a tensor decomposition approach for guaranteed learning of communities in a special class of hypergraphs modeling social tagging systems or folksonomies. A folksonomy is a tripartite 3-uniform hypergraph consi...

متن کامل

Detecting Geographically Dispersed Overlay Communities Using Community Networks

Community detection is an extremely useful technique in understanding the structure and function of a social network. Louvain algorithm, which is based on Newman-Girman modularity optimization technique, is extensively used as a computationally efficient method extract the communities in social networks. It has been suggested that the nodes that are in close geographical proximity have a higher...

متن کامل

Detection of Overlapping Communities in Social Tagging Systems

Some of the most popular sites in the Web today are social tagging systems or folksonomies (e.g. Delicious, Flickr, LastFm etc.) where users share resources and collaboratively annotate resources with tags which help in the search, personalized recommendation and organization of the resources. Folksonomies are modelled as tripartite (user-resource-tag) hypergraphs in order to study their networ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011